Mesh Segmentation With Geodesic Means Clustering of Sharp Vertices

Segmentation of Liver in Low-Contrast Images Using K-Means Clustering and Geodesic Active Contour Algorithms

In this paper, we present an algorithm to segment the liver in low-contrast CT images. As the first step of our algorithm, we define a search range for the liver boundary. Then, the EM algorithm is utilized to estimate parameters of a ‘Gaussian Mixture’ model that conforms to the intensity distribution of the liver. Using the statistical parameters of the intensity distribution, we introduce a ...

Clustering with Intelligent Linexk-Means

The intelligent LINEX k-means clustering is a generalization of the k-means clustering so that the number of clusters and their related centroid can be determined while the LINEX loss function is considered as the dissimilarity measure. Therefore, the selection of the centers in each cluster is not randomly. Choosing the LINEX dissimilarity measure helps the researcher to overestimate or undere...

CAD mesh model segmentation by clustering

CAD mesh models have been widely employed in current CAD/CAM systems, where it is quite useful to recognize the features of the CAD mesh models. The first step of feature recognition is to segment the CAD mesh model into meaningful parts. Although there are lots of mesh segmentation methods in literature, the majority of them are not suitable to CAD mesh models. In this paper, we design a mesh ...

K - Means Clustering for Automatic Image Segmentation

Image Segmentation With Modified K-Means Clustering Method

Image segmentation is used to recognizing some objects or something that is more meaningful and easier to analyze In this paper we are focus on the the K means clustering for segmentation of the image. K-means clustering is the most widely used clustering algorithm to position the radial basis function (RBF) centres. Its simplicity and ability to perform on-line clustering may inspire this choi...